Discrete-time GeoX/G(a, b)/1/N queues with single and multiple vacations
نویسندگان
چکیده
In this paper, we consider a discrete-time single-server finite-buffer batch arrival queue in which customers are served in batches according to a general bulk-service rule, that is, at least ‘a’ customers are needed to start a service with a maximum serving capacity of ‘b’ customers. The server takes a (single and multiple) vacation as soon as the queue length falls below ‘a’ at the completion of service. The interarrival times of batches are assumed to be independent and geometrically distributed. The service times of the batches and vacation times of the server are generally distributed and their durations are integral multiples of slot duration. We obtain queue length distributions at service completion, vacation termination, arbitrary, and prearrival epochs. Finally, we discuss various performance measures and numerical results. c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملAnalysis of a Batch Arrival General Bulk Service Queueing System with Multiple Vacations, Setup Time and Server’s Choice of Admitting Re-service
In many practical situations one can observe that the leaving batch of customers may request for re-service. Avi Itzhak and Naor (1963) have analyzed an M/G/1 queueing model with repair of service station on request by a leaving customer. Rosenberg and Uri Yechiali (1993) analyzed a bulk arrival general service single server queue with single and multiple vacations under LIFO service regime. Hu...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملAnalysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملAn Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical and Computer Modelling
دوره 45 شماره
صفحات -
تاریخ انتشار 2007